Topological Construction of Parameterized Bisimulation Limit
نویسندگان
چکیده
منابع مشابه
On Context Bisimulation for Parameterized Higher-order Processes
This paper studies context bisimulation for higher-order processes, in the presence of parameterization (viz. abstraction). We show that the extension of higher-order processes with process parameterization retains the characterization of context bisimulation by a much simpler form of bisimulation called normal bisimulation (viz. they are coincident), in which universal quantifiers are eliminat...
متن کاملLightweight Parameterized Suffix Array Construction
We present a first algorithm for direct construction of parameterized suffix arrays and parameterized longest common prefix arrays for non-binary strings. Experimental results show that our algorithm is much faster than näıve methods.
متن کاملSemirigid Construction of Topological Supergravities
We show how to construct topological N = 1 and 2 supergravity theories from appropriately constrained N = 3 and 4 ghost plus matter systems. In particular N = 4 susy is not needed to obtain the N = 1 topological theory. We give a description of the relevant supermoduli spaces which must be integrated to obtain the amplitudes of these theories, as well as explicit formulas for the ingredients en...
متن کاملConstruction of $\mu$-Limit Sets
The µ-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to infinity. In this article, for a given subshift in a large class of subshifts, we propose the construction of a cellular automaton which realizes this subshift as µ-limit set where µ is the uniform Bernoulli measure.
متن کاملRadiation Hybrid Map Construction Problem Parameterized
In this paper, we study the Radiation Hybrid Map Construction (RHMC) problem which is about reconstructing a genome from a set of gene clusters. The problem is known to be NP-complete even when all gene clusters are of size two and the corresponding problem (RHMC2) admits efficient constant-factor approximation algorithms. In this paper, for the first time, we consider the more general case whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.11.026